Beliefs in Markov Trees - From Local Computations to Local Valuation
نویسنده
چکیده
This paper is devoted to expressiveness of hypergraphs for which uncertainty propagation by local computations via Shenoy/Shafer method applies. It is demonstrated that for this propagation method for a given joint belief distribution no valuation of hyperedges of a hypergraph may provide with simpler hypergraph structure than valuation of hyperedges by conditional distributions. This has vital implication that methods recovering belief networks from data have no better alternative for finding the simplest hypergraph structure for belief propagation. A method for recovery tree-structured belief networks has been developed and specialized for Dempster-Shafer belief functions.
منابع مشابه
Investigating Contemporary Local Motifs on poshtie in Gonabad City
Pillows are small fluffy woven fabrics that are prepared (filled with fibers such as cotton or rug fluff) and after that the fabric is used for leaning in the parties. Due to lack of comprehensive research on woven works in Gonabad town, this article aims to investigate and classify the motifs of Gonabad pillows and their meaning and implications, in a descriptive way, in order to achieve the c...
متن کاملCutting down and pollarding of forest trees as perceived by local and governmental forest stakeholders and the impact of changes in fuel source on the forest (Case study: Sarvabad city forests)
Local people are always dependent on cutting down and pollarding of Zagros forests trees to provide their livelihoods needs such as house heating, cooking, supply of livestock forage and building materials. The stakeholders also have many conflicts in terms of forest utilization, which is the main cause of many irregularities in the forest management. The present study was conducted to investig...
متن کاملEpistemic irrelevance in credal networks: the case of imprecise Markov trees
We replace strong independence in credal networks with the weaker notion of epistemic irrelevance. Focusing on directed trees, we show how to combine local credal sets into a global model, and we use this to construct and justify an exact message-passing algorithm that computes updated beliefs for a variable in the tree. The algorithm, which is essentially linear in the number of nodes, is form...
متن کاملSemiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1704.03723 شماره
صفحات -
تاریخ انتشار 2017